A Novel Unconditionally Secure Multi-Secret Sharing Scheme
نویسندگان
چکیده
A multi-secret sharing scheme is a protocol to share some arbitrarily related secrets among a set of participants. A novel ) , ( n k -threshold multi-secret sharing scheme based on an isomorphism is proposed in this paper. The maximum number of secrets that can be shared in the proposed scheme is 2 k which is larger than that of most existing efficient ) , ( n k -threshold multi-secret sharing schemes. The computational complexity of the proposed scheme is equivalent to that of the latter schemes. The scheme is proved to be perfect and unconditionally secure.
منابع مشابه
Computationally secure multiple secret sharing: models, schemes, and formal security analysis
A multi-secret sharing scheme (MSS) allows a dealer to share multiple secrets among a set of participants. in such a way a multi-secret sharing scheme (MSS) allows a dealer to share multiple secrets among a set of participants, such that any authorized subset of participants can reconstruct the secrets. Up to now, existing MSSs either require too long shares for participants to be perfect secur...
متن کاملAn Efficient Threshold Verifiable Multi-Secret Sharing Scheme Using Generalized Jacobian of Elliptic Curves
In a (t,n)-threshold secret sharing scheme, a secret s is distributed among n participants such that any group of t or more participants can reconstruct the secret together, but no group of fewer than t participants can do. In this paper, we propose a verifiable (t,n)-threshold multi-secret sharing scheme based on Shao and Cao, and the intractability of the elliptic curve discrete logar...
متن کاملSecure secret reconstruction and multi-secret sharing schemes with unconditional security
In Shamir’s (t, n) secret sharing (SS) scheme, the secret s is divided into n shares by a dealer and is shared among n shareholders in such a way that any t or more than t shares can reconstruct this secret; but fewer than t shares cannot obtain any information about the secret s. In this paper, we will introduce the security problem that an adversary can obtain the secret when there are more t...
متن کاملUnconditionally Secure Proactive Secret Sharing Scheme with Combinatorial Structures
Verifiable secret sharing schemes (VSS) are secret sharing schemes dealing with possible cheating by the participants. In this paper, we propose a new unconditionally secure VSS. Then we construct a new proactive secret sharing scheme based on that VSS. In a proactive scheme, the shares are periodically renewed so that an adversary cannot get any information about the secret unless he is able t...
متن کاملOn Unconditionally Secure Robust Distributed Key Distribution Centers
A Key Distribution Center enables secure communications among groups of users in a network by providing common keys that can be used with a symmetric encryption algorithm to encrypt and decrypt messages the users wish to send to each other. A Distributed Key Distribution Center is a set of servers of a network that jointly realize a Key Distribution Center. In this paper we propose an unconditi...
متن کامل